Bicircular signed-graphic matroids

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On cographic matroids and signed-graphic matroids

We prove that a connected cographic matroid of a graph G is the bias matroid of a signed graph Σ iff G imbeds in the projective plane. In the case that G is nonplanar, we also show that Σ must be the projective-planar dual signed graph of an actual imbedding of G in the projective plane. As a corollary we get that, if G1, . . . , G29 denote the 29 nonseparable forbidden minors for projective-pl...

متن کامل

Decompositions of signed-graphic matroids

We give a decomposition theorem for signed graphs whose frame matroids are binary and a decomposition theorem for signed graphs whose frame matroids are quaternary.

متن کامل

Decomposition of Binary Signed-Graphic Matroids

In this paper we employ Tutte’s theory of bridges to derive a decomposition theorem for binary matroids arising from signed graphs. The proposed decomposition differs from previous decomposition results on matroids that have appeared in the literature in the sense that it is not based on k-sums, but rather on the operation of deletion of a cocircuit. Specifically, it is shown that certain minor...

متن کامل

Recognition Algorithms for Binary Signed-Graphic Matroids

In this paper we provide two recognition algorithms for the class of signed-graphic matroids along with necessary and sufficient conditions for a matroid to be signed-graphic. Specifically, we provide a polynomial-time algorithm which determines whether a given binary matroid is signed-graphic and an algorithm which determines whether a general matroid given by an independece oracle is binary s...

متن کامل

Representations of bicircular matroids

Coullard, C.R., J.G. de1 Greco and D.K. Wagner, Representations of bicircular matroids, Discrete Applied Mathematics 32 (1991) 223-240. A bicircular matroid is a matroid defined on the edge set of a graph. Two different graphs can have the same bicircular matroid. The first result of this paper is a characterization of the collection of graphs having the same bicircular matroid as a given arbit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2014

ISSN: 0012-365X

DOI: 10.1016/j.disc.2014.03.022